Algorithms for ball hulls and ball intersections in strictly convex normed planes
نویسندگان
چکیده
Extending results of Hershberger and Suri for the Euclidean plane, we show that ball hulls and ball intersections of sets of n points in strictly convex normed planes can be constructed in O(n log n) time. In addition, we confirm that, like in the Euclidean subcase, the 2-center problem with constrained circles can be solved also for strictly convex normed planes in O(n2) time. Some ideas for extending these results to more general types of normed planes are also
منابع مشابه
Geometric clustering in normed planes
Given two sets of points A and B in a normed plane, we prove that there are two linearly separable sets A′ and B′ such that diam(A′) ≤ diam(A), diam(B′) ≤ diam(B), and A′ ∪B′ = A ∪B. This extends a result for the Euclidean distance to symmetric convex distance functions. As a consequence, some Euclidean k-clustering algorithms are adapted to normed planes, for instance, those that minimize the ...
متن کاملSome geometry of convex bodies in C(K) spaces
We deal with some problems related to vector addition and diametric completion procedures of convex bodies in C(K) spaces. We prove that each of the following properties of convex bodies in C(K) characterizes the underlying compact Hausdorff space K as a Stonean space: (i) C(K) has a generating unit ball; (ii) all Maehara sets in C(K) are complete; (iii) the set Dd of all complete sets of diame...
متن کاملGeometric Algorithms for Minimal Enclosing Disks in Strictly Convex Normed Planes
In 1857, Sylvester [16] posed the minimal enclosing disc problem, which asks for the smallest disc which covers a given finite point set in the Euclidean plane. A natural extension of this is obtained if one replaces the family of Euclidean discs by the family F of homothetic images of a given non-empty, convex, compact set B ⊂ R which is centrally symmetric with respect to its interior point 0...
متن کاملCircumradius versus Side Lengths of Triangles in Linear Normed Spaces
Given a planar convex body B centered at the origin, we denote by M(B) the Minkowski plane (i.e., two-dimensional linear normed space) with the unit ball B. For a triangle T in M(B) we denote by RB(T ) the least possible radius of a Minkowskian ball enclosing T. We remark that in terms of location science RB(T ) is the optimum of the minimax location problem with distance induced by B and verti...
متن کامل2 00 2 Projections in Normed Linear Spaces and Sufficient Enlargements
Definition. A symmetric with respect to 0 bounded closed convex set A in a finite dimensional normed space X is called a sufficient enlargement for X (or of B(X)) if for arbitrary isometric embedding of X into a Banach space Y there exists a projection P : Y → X such that P (B(Y)) ⊂ A (by B we denote the unit ball). The main purpose of the present paper is to continue investigation of sufficien...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1411.7159 شماره
صفحات -
تاریخ انتشار 2014